Output distribution of the Burrows - Wheeler transform ' Karthik
نویسندگان
چکیده
The Burrows-Wheeler transform is a block-sorting algorithm which has been shown empirically to be useful in compressing text data. In this paper we study the output distribution of the transform for i.i.d. sources, tree sources and stationary ergodic sources. We can also give analytic bounds on the performance of some universal compression schemes which use the Burrows-Wheeler transform.
منابع مشابه
Burrows-Wheeler compression: Principles and reflections
After a general description of the Burrows Wheeler Transform and a brief survey of recent work on processing its output, the paper examines the coding of the zero-runs from the MTF recoding stage, an aspect with little prior treatment. It is concluded that the original scheme proposed by Wheeler is extremely efficient and unlikely to be much improved. The paper then proposes some new interpreta...
متن کاملAn Error-Resilient Blocksorting Compression Algorithm
A Burrows-Wheeler Compressor breaks input into blocks, quickly makes each more compressible, and compresses the modified block with a simple arithmetic or Huffman compressor. We propose an error-resilient Inverse Burrows-Wheeler Compressor. It uses a small amount of overhead alongside output from an ordinary BWT and MTF. It is also size-competitive with BZIP, a popular Burrows-Wheeler compressor.
متن کاملWheeler Graphs: Variations on a Theme by Burrows and Wheeler
The famous Burrows-Wheeler Transform was originally defined for single strings but variations have been developed for sets of strings, labelled trees, de Bruijn graphs, alignments, etc. In this talk we propose a unifying view that includes many of these variations and that we hope will simplify the search for more. Somewhat surprisingly we get our unifying view by considering the Nondeterminist...
متن کاملHigher Compression from the Burrows-Wheeler Transform by Modified Sorting
We show that the ordering used in the sorting stage of the Burrows-Wheeler transform, an aspect hitherto ignored, can have a significant impact on the size of the compressed data. We present experimental results showing smaller compressed output achieved with two modifications to the sorting: using a better alphabet ordering and reflecting the sorted strings as in binary reflected Gray coding. ...
متن کاملThe Burrows-Wheeler Algorithm
The Burrows-Wheeler Algorithm was published in the year 1994 by Michael Burrows and David Wheeler in the research report “A Block-sorting Lossless Data Compression Algorithm”. This research report is based on an unpublished work by David Wheeler from the year 1983. The Burrows-Wheeler Algorithm will used for data compression. The algorithm consists of several stages and these stages are perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000